Quantum Adversary (Upper) Bound
نویسنده
چکیده
We propose a method for upper bounding the general adversary bound for certain boolean functions. Due to the the tightness of query complexity and the general adversary bound [5], this gives an upper bound on the quantum query complexity of those functions. We give an example where this upper bound is smaller than the query complexity of any known quantum algorithm.
منابع مشابه
Adversary-Based Parity Lower Bounds with Small Probability Bias
The quantum query complexity of the parity function on n variables is known to be exactly n/2, for any error probability ǫ < 1/2. The upper bound follows from a modification of Deutsch’s quantum algorithm that computes the parity using n/2 queries and with zero probability of error [CEMM98]. Also, the lower bound of n/2 can be obtained by a simple application of the polynomial method, and the p...
متن کاملLeast span program witness size equals the general adversary lower bound on quantum query complexity
Span programs form a linear-algebraic model of computation, with span program “size” used in proving classical lower bounds. Quantum query complexity is a coherent generalization, for quantum algorithms, of classical decision-tree complexity. It is bounded below by a semi-definite program (SDP) known as the general adversary bound. We connect these classical and quantum models by proving that f...
متن کاملA Universal Adiabatic Quantum Query Algorithm
Quantum query complexity is known to be characterized by the so-called quantum adversary bound. While this result has been proved in the standard discretetime model of quantum computation, it also holds for continuous-time (or Hamiltonianbased) quantum computation, due to a known equivalence between these two query complexity models. In this work, we revisit this result by providing a direct pr...
متن کاملSecurity analysis of Quantum-Readout PUFs in the case of generic challenge-estimation attacks
Quantum Readout PUFs (QR-PUFs) have been proposed as a technique for remote authentication of objects. The security is based on basic quantum information theoretic principles and the assumption that the adversary cannot efficiently implement arbitrary unitary transformations. We analyze the security of QR-PUF schemes in the case where each challenge consists of precisely n quanta and the dimens...
متن کاملOptimal Quantum Adversary Lower Bounds for Ordered Search
The goal of the ordered search problem is to find a particular item in an ordered list of n items. Using the adversary method, Høyer, Neerbek, and Shi proved a quantum lower bound for this problem of 1 π lnn + Θ(1). Here, we find the exact value of the best possible quantum adversary lower bound for a symmetrized version of ordered search (whose query complexity differs from that of the origina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Chicago J. Theor. Comput. Sci.
دوره 2013 شماره
صفحات -
تاریخ انتشار 2012